On the properties of $\alpha$-unchaining single linkage hierarchical clustering
نویسنده
چکیده
In the election of a hierarchical clustering method, theoretic properties may give some insight to determine which method is the most suitable to treat a clustering problem. Herein, we study some basic properties of two hierarchical clustering methods: α-unchaining single linkage or SL(α) and a modified version of this one, SL∗(α). We compare the results with the properties satisfied by the classical linkage-based hierarchical clustering methods.
منابع مشابه
A density-sensitive hierarchical clustering method
We define a hierarchical clustering method: α-unchaining single linkage or SL(α). The input of this algorithm is a finite metric space and a certain parameter α. This method is sensitive to the density of the distribution and offers some solution to the so called chaining effect. We also define a modified version, SL∗(α), to treat the chaining through points or small blocks. We study the theore...
متن کاملChoosing the Best Hierarchical Clustering Technique Based on Principal Components Analysis for Suspended Sediment Load Estimation
1- INTRODUCTION The assessment of watershed sediment load is necessary for controling soil erosion and reducing the potential of sediment production. Different estimates of sediment amounts along with the lack of long-term measurements limits the accessibility to reliable data series of erosion rate and sediment yield. Therefore, the observed data of suspended sediment load could be used to ...
متن کاملGromov-Hausdorff stability of linkage-based hierarchical clustering methods
A hierarchical clustering method is stable if small perturbations on the data set produce small perturbations in the result. This perturbations are measured using the Gromov-Hausdorff metric. We study the problem of stability on linkage-based hierarchical clustering methods. We obtain that, under some basic conditions, standard linkage-based methods are semi-stable. This means that they are sta...
متن کاملDiscerning Linkage-Based Algorithms among Hierarchical Clustering Methods
Selecting a clustering algorithm is a perplexing task. Yet since different algorithms may yield dramatically different outputs on the same data, the choice of algorithm is crucial. When selecting a clustering algorithm, users tend to focus on cost-related considerations (software purchasing costs, running times, etc). Differences concerning the output of the algorithms are not usually considere...
متن کاملHierarchical Quasi-Clustering Methods for Asymmetric Networks
This paper introduces hierarchical quasiclustering methods, a generalization of hierarchical clustering for asymmetric networks where the output structure preserves the asymmetry of the input data. We show that this output structure is equivalent to a finite quasi-ultrametric space and study admissibility with respect to two desirable properties. We prove that a modified version of single linka...
متن کامل